Self-description for Construction and Execution in Graph Rewriting Automata
نویسندگان
چکیده
In this paper, we consider how self-description can be realized for construction and execution in a single framework of a variant of graph rewriting systems, called graph rewriting automata. As an example of self-description for construction, a self-replication based on a self-description is shown. Meta-node structure is introduced for selfdescription for execution that enables us to embed rule sets in the graph structure. It can be a model of systems that maintain and modify themselves.
منابع مشابه
Efficient Completion of Weighted Automata
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of existing edges. We apply this method in the construction of matchbound certificates for automatically proving termination of string rewriting. We re-im...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملA Graph Grammar Approach for Durational Action Timed Automata Determinization
Durational Action Timed Automata (DATA) is a semantic model for expressing the behavior of real time systems where actions have durations. In this paper, we propose an approach for translating a DATA structure to a corresponding deterministic one. For this purpose, a meta-model of DATA model and a transformation grammar are defined. Programs are written in Python language and implemented under ...
متن کاملPrinciples for the Automated Construction of Distributed Application Software Execution Models
Models of software execution are used for many purposes, such as program understanding, re-engineering, reuse, performance analysis, and debugging. Often these models are mental pictures that are developed from design documents, source code examination, or experience with the system. Manually constructing models for a small software system is relatively easy, but it is expensive, difficult, and...
متن کاملGenerative Network Automata: A Generalized Framework for Modeling Adaptive Network Dynamics Using Graph Rewritings
A variety of modeling frameworks have been proposed and utilized in complex systems studies, including dynamical systems models that describe state transitions on a system of fixed topology, and self-organizing network models that describe topological transformations of a network with little attention paid to dynamical state changes. Earlier network models typically assumed that topological tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005